Acyclicity and reduction
نویسندگان
چکیده
The literature provides dichotomies involving homomorphisms (like the G0 dichotomy) or reductions (like the characterization of sets potentially in a Wadge class of Borel sets, which holds on a subset of a product). However, part of the motivation behind the latter result was to get reductions on the whole product, like in the classical notion of Borel reducibility considered in the study of analytic equivalence relations. This is not possible in general. We show that, under some acyclicity (and also topological) assumptions, this is widely possible. In particular, we prove that, for any nonself dual Borel class Γ, there is a concrete finite ⊑c-antichain basis for the class of Borel relations, whose closure has acyclic symmetrization, and which are not potentially inΓ. Along similar lines, we provide a sufficient condition for ⊑c-reducing G0. We also prove a similar result giving a minimum set instead of an antichain if we allow rectangular reductions. 2010 Mathematics Subject Classification. Primary: 03E15, Secondary: 54H05
منابع مشابه
Acyclicity and Coherence in Multiplicative Exponential Linear Logic
We give a geometric condition that characterizes MELL proof structures whose interpretation is a clique in non-uniform coherent spaces: visible acyclicity. We define the visible paths and we prove that the proof structures which have no visible cycles are exactly those whose interpretation is a clique. It turns out that visible acyclicity has also nice computational properties, especially it is...
متن کاملAcyclicity is Modular for Orthogonal TRSs
Acyclicity is shown to be a modular property of orthogonal first-order term rewriting systems (TRSs), which answers a question raised by Klop. Here, a rewrite system → is acyclic if it doesn’t allow non-empty cycles, where a cycle on t is a reduction sequence of the form t t. We assume knowledge of modularity, standardisation, tracing, and externality in term rewriting. To be specific, we freel...
متن کاملExtension Preservation Theorems on Classes of Acyclic Finite Structures
A class of structures satisfies the extension preservation theorem if, on this class, every first order sentence is preserved under extension iff it is equivalent to an existential sentence. We consider different acyclicity notions for hypergraphs (γ, β and α-acyclicity and also acyclicity on hypergraph quotients) and estimate their influence on the validity of the extension preservation theore...
متن کاملOn the Relationship of Joint Acyclicity and Super-Weak Acyclicity
Rules that allow existential quantifiers in the head (conclusion) have been studied extensively in knowledge representation, databases, and logic programming (in the related form of logic programs with function symbols). In general, it is not decidable if a set of such rules admits a finite model, but a number of sufficient conditions have been proposed to detect situations where this is the ca...
متن کاملAnswer Set Programming modulo
Acyclicity constraints are prevalent in knowledge representation and applications where acyclic data structures such as DAGs and trees play a role. Recently, such constraints have been considered in the satisfiability modulo theories (SMT) framework, and in this paper we carry out an analogous extension to the answer set programming (ASP) paradigm. The resulting formalism, ASP modulo acyclicity...
متن کاملOn the complexity of two acyclic subhypergraphs problems
We investigate the computational complexity of two decision problems on hypergraphs, namely the Spanning Acyclic Subhypergraph problem and the Maximal Acyclic Subhypergraph problem. The former is the existence of an acyclic subhypergraph such that each vertex of the input hypergraph is contained in at least one hyperedge of the subhypergraph. The latter is the existence of an acyclic subhypergr...
متن کامل